Compressed depth sequences
نویسندگان
چکیده
منابع مشابه
Compressed depth sequences
We show how, given a probability distribution P over a set of size n, in O(n) time we can construct an efficient data structure that stores a codewith less than 3 bits redundancy, and takes o(n) bits of space when P consists of o(n/ log n) runs of nearly equal probabilities. © 2008 Elsevier B.V. All rights reserved.
متن کاملGrammar Compressed Sequences
Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need to represent highly repetitive sequences, and classical statistical compression proves ineffective. We introduce, instead, grammar-based representations for repetitive sequences, which ...
متن کاملGrammar Compressed Sequences with Rank/Select Support
Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. In several recent applications, the need to represent highly repetitive sequences arises, where statistical compression is ineffective. We introduce grammar-based representations for repetitive sequences, which use up ...
متن کاملCompressed Data Structures for Dynamic Sequences
We consider the problem of storing a dynamic string S over an alphabetΣ = { 1, . . . , σ } in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: access(i, S) returns the i-th symbol in S, ranka(i, S) counts how many times a symbol a occurs among the first i positions in S, and selecta(i, S) finds the position where a symbol a ...
متن کاملStatistical Feature Extraction from Compressed Video Sequences
General rights This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available: Explore Bristol Research is a digital archive and the intention is that deposited content should not be removed. However, if you believe that this version of the work breaches copyright law please contact open-ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.11.003